package com.ruijixiang.leetcode.everyday.leetcode2024.leetcode202412;

import java.util.ArrayList;
import java.util.List;

public class leetcode20241219 {
    /**
     * 找到稳定山的下标
     * @param height
     * @param threshold
     * @return
     */
    public List<Integer> stableMountains(int[] height, int threshold){
        List<Integer> ans=new ArrayList<>();
        for(int i=1;i<height.length;i++){
            if(height[i-1]>threshold){
                ans.add(i);
            }
        }
        return ans;
    }
}
